In mathematics, a biased graph is a graph with a list of distinguished circles (edge sets of simple cycles), such that if two circles in the list are contained in a theta graph, then so is the third circle of the theta graph. A biased graph is a generalization of the combinatorial essentials of a gain graph and in particular of a signed graph.
详细百科解释